Training variational quantum algorithms with random gate activation
نویسندگان
چکیده
A new training strategy with progressive random gate activation for variational quantum algorithms greatly mitigates barren plateaus and avoids the local minima while being resource efficient noise resilient.
منابع مشابه
Gate scheduling for quantum algorithms
As the effort to scale up existing quantum hardware proceeds, the necessity of effective methods to schedule quantum gates and minimize the number of operations becomes more compelling. Three are the constraints that have to be taken into account: The order or dependency of the quantum gates in the specific algorithm, the fact that any qubit may be involved in at most one gate at a time, and th...
متن کاملTowards Practical Quantum Variational Algorithms
The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the fidelity of gates high enough that it can be executed without quantum error correction. Such quantum state preparation can be used in variational approaches, optimizing parameters in the circuit to minimi...
متن کاملGate-efficient discrete simulations of continuous-time quantum query algorithms
We show how to efficiently simulate continuous-time quantum query algorithms that run in time T in a manner that preserves the query complexity (within a polylogarithmic factor) while also incurring a small overhead cost in the total number of gates between queries. By small overhead, we mean T within a factor that is polylogarithmic in terms of T and a cost measure that reflects the cost of co...
متن کاملRandom Hamiltonian Models and Quantum Prediction Algorithms
This paper describes an algorithm for selecting a consistent set within the consistent histories approach to quantum mechanics and investigates its properties. The algorithm select from among the consistent sets formed by projections defined by the Schmidt decomposition by making projections at the earliest possible time. The algorithm unconditionally predicts the possible events in closed quan...
متن کاملA random walk approach to quantum algorithms.
The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial; pure quantum dynamics is deterministic, so randomness only enters during the measurement phase, i.e. when converting the quantum information into classical information. The ou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical review research
سال: 2023
ISSN: ['2643-1564']
DOI: https://doi.org/10.1103/physrevresearch.5.l032040